On Beam Search for Multicriteria Combinatorial Optimization Problems
نویسندگان
چکیده
In this article, the beam search approach is extended to multicriteria combinatorial optimization, with particular emphasis on its application to bicriteria { 0,1} knapsack problems. The beam search uses several definitions of upper bounds of knapsack solutions as well as a new selection procedure based on -indicator that allows to discard uninteresting solutions. An in-depth experimental analysis on a wide benchmark set o nstances suggests that this approach can achieve very good solution quality in a small fraction of time needed to solve the problem to optimality by state-of-the-art algorithms.
منابع مشابه
Compromise Solutions in Multicriteria Combinatorial Optimization
In multicriteria optimization, a compromise solution is a feasible solution whose cost vector minimizes the distance to the ideal point w.r.t. a given norm. The coordinates of the ideal point are given by the optimal values for the single optimization problem for each criterion. We show that the concept of compromise solutions fits nicely into the existing notion of Pareto optimality: For a hug...
متن کاملA Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems
This paper is devoted to the search for Choquet-optimal solutions in multicriteria combinatorial optimization with application to spanning tree problems and knapsack problems. After recalling basic notions concerning the use of Choquet integrals for preference aggregation, we present a condition (named preference for interior points) that characterizes preferences favouring well-balanced soluti...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملRecovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems
A hybrid heuristic method for combinatorial optimization problems is proposed that combines di erent classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution...
متن کامل